Formal Concept Analysis in knowledge processing: A survey on models and techniques

This is the first part of a large survey paper in which we analyze recent literature on Formal Concept Analysis (FCA) and some closely related disciplines using FCA. We collected 1072 papers published between 2003 and 2011 mentioning terms related to Formal Concept Analysis in the title, abstract and keywords. We developed a knowledge browsing environment to support our literature analysis process. We use the visualization capabilities of FCA to explore the literature, to discover and conceptually represent the main research topics in the FCA community. In this first part, we zoom in on and give an extensive overview of the papers published between 2003 and 2011 on developing FCA-based methods for knowledge processing. We also give an overview of the literature on FCA extensions such as pattern structures, logical concept analysis, relational concept analysis, power context families, fuzzy FCA, rough FCA, temporal and triadic concept analysis and discuss scalability issues.     

Free-scaling your data center

The increasing popularity of both small and large private clouds and expanding public clouds poses new requirements to data center (DC) architectures. First, DC architectures should be incrementally scalable allowing the creation of DCs of arbitrary size with consistent performance characteristics. Second, initial DC deployments should be incrementally expandable supporting small-scale upgrades without decreasing operation efficiency. A DC architecture possessing both properties satisfies the requirement of free-scaling.Recent work in DC design focuses on traditional performance and scalability characteristics, therefore resulting in symmetric topologies whose upgradability is coarse-grained at best. In our earlier work we proposed Scafida, an asymmetric, scale-free network inspired DC topology which scales incrementally and has favorable structural characteristics. In this paper, we build on Scafida and propose a full-fledged DC architecture achieving free-scaling called FScafida. Our main contribution is threefold. First, we propose an organic expansion algorithm for FScafida; this combined with Scafida’s flexible original design results in a freely scalable architecture. Second, we introduce the Effective Source Routing mechanism that provides near-shortest paths, multi-path and multicast capability, and low signaling overhead by exploiting the benefits of the FScafida topology. Third, we show based on extensive simulations and a prototype implementation that FScafida is capable of handling the traffic patterns characteristic of both enterprise and cloud data centers, tolerates network equipment failures to a high degree, and allows for high bisection bandwidth.     

A novel intelligent verification platform based on a structured analysis model

An intelligent verification platform based on a structured analysis model is presented.Using an abstract model mechanism with specific signal interfaces for user callback,the unified structured analysis data,shared by the electronic system level design,functional verification,and performance evaluation,enables efficient management review,auto-generation of code,and modeling in the transaction level.We introduce the class tree,flow parameter diagram,structured flow chart,and event-driven finite state machine as structured analysis models.As a sand table to carry maps from different perspectives and levels via an engine,this highly reusable platform provides the mapping topology to search for unintended consequences and the graph theory for comprehensive coverage and smart test cases.Experimental results show that the engine generates efficient test sequences,with a sharp increase in coverage for the same vector count compared with a random test.     

A topology control algorithm based on D-region fault tolerance

In a wireless network, node failure due to either natural disasters or human intervention can cause network partitioning and other communication problems. For this reason, a wireless network should be fault tolerant. At present, most researchers use k-connectivity to measure fault tolerance, which requires the network to be connected after the failure of any up to k-1 nodes. However, wireless network node failures are usually spatially related, and particularly in military applications, nodes from the same limited area can fail together. As a metric of fault-tolerance, k-connectivity fails to capture the spatial relativity of faults and hardly satisfies the fault tolerance requirements of a wireless network design. In this paper, a new metric of fault-tolerance, termed D-region fault tolerance, is introduced to measure wireless network fault tolerance. A D-region fault tolerant network means that even after all the nodes have failed in a circular region with diameter D, it still remains connected. Based on D-region fault tolerance, we propose two fault-tolerant topology control algorithms--the global region fault tolerance algorithm (GRFT) and the localized region fault tolerance algorithm (LRFT). It is theoretically proven that both algorithms are able to generate a network with D-region fault tolerance. Simulation results indicate that with the same fault tolerance capabilities, networks based on both GRFT and LRFT algorithms have a lower transmission radius and lower logical degree.     

An application of computer algebra to algebraic topology

In this work we study a certain formal power series that is of considerable interest to algebraic topologists, the [p ^k ]-series. We define the series in a purely combinatorial way and indicate its usefulness. Then, by using computer algebra techniques, we compute it up to a high coefficient. Our computation has led to some interesting information on the coefficients of the [p ^k ]-series.     

基于蜂窝网络拓扑的无线传感网定位算法

针对无线传感网中DV-Hop定位算法过于依赖信标节点数量以及定位精度低的问题,提出基于蜂窝网络拓扑的定位算法(LABCNT)。通过对网络中节点的有向筛选,选取满足特定条件的节点,构造一个蜂窝的网络拓扑结构,得到网络上节点的相对位置;根据拓扑结构中的第二个信标节点确定网络上节点的绝对位置;将已定位的节点升级为协作节点,采用最小二乘算法对域内其它未知节点进行定位。仿真结果表明,与DH-RLS、IDVH-LA、IDVH-HCHEC算法相比,LABCNT算法的定位精度较高,所需信标节点数量最少。     

Time-varying formation control for unmanned aerial vehicles with switching interaction topologies

Time-varying formation control problems for unmanned aerial vehicle (UAV) swarm systems with switching interaction topologies are studied. Necessary and sufficient conditions for UAV swarm systems with switching interaction topologies to achieve predefined time-varying formations are proposed. Based on the common Lyapunov functional approach and algebraic Riccati equation technique, an approach to design the formation protocol is presented. An explicit expression of the formation reference function is derived to describe the macroscopic movement of the whole UAV formation. A quadrotor formation platform consisting of four quadrotors is introduced. Outdoor experiments are performed to demonstrate the effectiveness of the theoretical results.     

Model development in scientific discovery learning with a computer-based physics task

Based on theories of scientific discovery learning (SDL) and conceptual change, this study explores students' preconceptions in the domain of torques in physics and the development of these conceptions while learning with a computer-based SDL task. As a framework we used a three-space theory of SDL and focused on model space, which is supposed to contain the current conceptualization/model of the learning domain, and on its change through hypothesis testing and experimenting. Three questions were addressed: (1) What are students' preconceptions of torques before learning about this domain? To do this a multiple-choice test for assessing students' models of torques was developed and given to secondary school students (N = 47) who learned about torques using computer simulations. (2) How do students' models of torques develop during SDL? Working with simulations led to replacement of some misconceptions with physically correct conceptions. (3) Are there differential patterns of model development and if so, how do they relate to students’ use of the simulations? By analyzing individual differences in model development, we found that an intensive use of the simulations was associated with the acquisition of correct conceptions. Thus, the three-space theory provided a useful framework for understanding conceptual change in SDL.     

Multi-formation control of nonlinear leader-following multi-agent systems

This paper deals with the multi-formation control problem for nonlinear leader-following multi-agent systems. Both the fixed topology case and the switching topology case are considered. The neighbor-based multi-formation control protocols are proposed under the assumption that for one subgroup, the total information received from other subgroups is zero. Then, based on the Lyapunov stability theory combined with the algebraic graph theory, sufficient conditions are established to ensure that the leader-following multi-agent systems with nonlinear dynamics can reach and maintain the desired multi-formation control. Finally, simulation examples are provided to illustrate the effectiveness of the theoretical results.     

Improving system performance for stochastic activity network: A simulation approach

An activity network with returning loop activities has a wide variety of applications, but can cause a heavy computational burden for large networks. Moreover, if an activity processing time and/or the probability of taking a particular activity changes when the number of activity visits is added, the computation is very complicated and difficult. We propose a simulation approach to deal with stochastic activity networks consisting of multiple terminal nodes, no limit on looping activities, non-constant activity selection probabilities, and non-deterministic activity times following arbitrary distributions. Probability and time control functions are introduced to reflect the acceleration, or learning effect, of repeated activities. Performance measures such as system success/failure probabilities, time to completion/success/failure times, time between success/failure, and the pth percentile times of a project are obtained. A series of sensitivity analysis was performed to understand the trend and behavior of system performance. A cost function is developed to find an optimal strategy by manipulating control factors. To illustrate the efficacy of this simulation approach a new drug discovery and development project was analyzed. The Promodel simulation language was used for performance evaluations, and the SimRunner optimization tool for obtaining the optimal solution.